全文获取类型
收费全文 | 467篇 |
免费 | 201篇 |
国内免费 | 32篇 |
出版年
2024年 | 1篇 |
2022年 | 3篇 |
2021年 | 18篇 |
2020年 | 11篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 31篇 |
2016年 | 41篇 |
2015年 | 23篇 |
2014年 | 46篇 |
2013年 | 73篇 |
2012年 | 33篇 |
2011年 | 34篇 |
2010年 | 23篇 |
2009年 | 31篇 |
2008年 | 34篇 |
2007年 | 32篇 |
2006年 | 28篇 |
2005年 | 41篇 |
2004年 | 27篇 |
2003年 | 21篇 |
2002年 | 21篇 |
2001年 | 18篇 |
2000年 | 8篇 |
1999年 | 13篇 |
1998年 | 16篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 17篇 |
1989年 | 2篇 |
排序方式: 共有700条查询结果,搜索用时 16 毫秒
11.
12.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
13.
14.
15.
16.
17.
把英语作为第二语言的教学是20世纪60年代在美国兴起并逐步走向独立的科目,它在综合相关专业的同时正在朝专业化方向发展。近年来其硕士层面的教育为全球培养了大量合格的中小学英语教师,取得了较好的成绩。本文以曼卡托明尼苏达州立大学英语系为例,并结合笔者在该系攻读TESL硕士学位时的经历,解析其主要课程及设置理据。 相似文献
18.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
19.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
20.
针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。 相似文献